منابع مشابه
Stable Power Domains
In the category of stable dcpo's, free constructions w.r.t. algebraic theories exist. From this, we obtain various stable power domain constructions. After handling their properties in general, we concentrate on the stable Plotkin power construction. For continuous ground domains, it is explicitly described in terms of saturated compact sets. In case of algebraic ground domains, this descriptio...
متن کاملOn Power Stable Ideals
We define the notion of a power stable ideal in a polynomial ring R[X] over an integral domain R. It is proved that a maximal ideal χ M in R[X] is power stable if and only if P t is P primary for all t ≥ 1 for the prime ideal P = M ∩ R. Using this we prove that for a Hilbert domain R any radical ideal in R[X] which is a finite intersection G-ideals is power stable. Further, we prove that if R i...
متن کاملEvent Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linear Logic (MALL). We use tools from Domain theory to develop a semantic notion of proof net for MALL, and prove a Sequentialization Theorem. This work forms part of a continuation of previous joint work with Radha Jagadeesan...
متن کاملAn Algebraic Approach to Stable Domains
Day [75] showed that the category of continuous lattices and maps which preserve directed joins and arbitrary meets is the category of algebras for a monad over Set, Sp or Pos, the free functor being the set of filters of open sets. Separately, Berry [78] constructed a cartesian closed category whose morphisms preserve directed joins and connected meets, whilst Diers [79] considered similar fun...
متن کاملA logical approach to stable domains
Building on earlier work by Guo-Qiang Zhang on disjunctive information systems, and by Thomas Ehrhard, Pasquale Malacaria, and the first author on stable Stone duality, we develop a framework of disjunctive propositional logic in which theories correspond to algebraic L-domains. Disjunctions in the logic can be indexed by arbitrary sets (as in geometric logic) but must be provably disjoint. Thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)00121-k